πŸ‘©β€πŸ’» 42889. μ‹€νŒ¨μœ¨

@Seongukbaek Posted June 07, 2022 Β· Updated June 07, 2022 Β· 2 min read

문제

Programmers - μ‹€νŒ¨μœ¨

πŸ“ Logic

for (int i = 0; i < N; i++) userStage.add(new Stage(i + 1)); for (int s : stages) { if (s > N) continue; userStage.get(s - 1).incFail(); } for (Stage s : userStage) { if (users == 0) break; double tmp = s.fail / users; users -= s.fail; s.setFail(tmp); }
  • ArrayList<Stage> λ₯Ό μ‚¬μš©ν•΄ λ„λ‹¬ν•œ 인원 μˆ˜μ™€ μ‹€νŒ¨μœ¨μ„ μ €μž₯
  • λ‚œμ΄λ„λ³„ 도달 인원 수λ₯Ό 0으둜 μ΄ˆκΈ°ν™”ν•œ ν›„, μ‹€νŒ¨μœ¨ 계산을 μœ„ν•œ λ„λ‹¬ν–ˆμ§€λ§Œ ν΄λ¦¬μ–΄ν•˜μ§€ λͺ»ν•œ 인원 수λ₯Ό 계산
  • μ•ž λ‚œμ΄λ„λΆ€ν„°, ν΄λ¦¬μ–΄ν•˜μ§€ λͺ»ν•œ 인원 수 / 전체 μΈμ›λ‘œ μ‹€νŒ¨μœ¨μ„ κ³„μ‚°ν•œλ‹€.

    • 이후 전체 인원은 ν•΄λ‹Ή λ‚œμ΄λ„μ— λ„λ‹¬ν–ˆμ§€λ§Œ ν΄λ¦¬μ–΄ν•˜μ§€ λͺ»ν•œ 인원 수만큼 μ°¨κ°ν•œλ‹€.

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
import java.util.*; class Stage implements Comparable<Stage> { int user; double fail; public Stage(int user) { this.user = user; this.fail = 0; } public void incFail() { this.fail += 1; } public void setFail(double fail) { this.fail = fail; } @Override public int compareTo(Stage o) { if (o.fail == this.fail) return this.user - o.user; if (o.fail > this.fail) return 1; return -1; } } class Solution { public int[] solution(int N, int[] stages) { double users = stages.length; ArrayList<Stage> userStage = new ArrayList<>(); for (int i = 0; i < N; i++) userStage.add(new Stage(i + 1)); for (int s : stages) { if (s > N) continue; userStage.get(s - 1).incFail(); } for (Stage s : userStage) { if (users == 0) break; double tmp = s.fail / users; users -= s.fail; s.setFail(tmp); } Collections.sort(userStage); int[] answer = new int[N]; for (int i = 0; i < N; i++) answer[i] = userStage.get(i).user; return answer; } }

✏️ Review

  • μ‰¬μš΄ λ¬Έμ œμ˜€μœΌλ‚˜ μ’€ 더 효율적인 자료ꡬ쑰λ₯Ό λΉ λ₯Έ μ‹œκ°„ 내에 λ– μ˜¬λ¦¬μ§€ λͺ»ν•œ 게 λ¬Έμ œμ˜€λ‹€.
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€